Quantum Stabilizer Codes and Classical Linear Codes

نویسنده

  • Richard Cleve
چکیده

We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result—which applies to degenerate as well as nondegenerate codes— previously established necessary conditions for classical linear codes can be easily translated into necessary conditions for quantum stabilizer codes. Examples of specific consequences are: for a quantum channel subject to a δfraction of errors, the best asymptotic capacity attainable by any stabilizer code cannot exceed H( 2 + √ 2δ(1 − 2δ)); and, for the depolarizing channel with fidelity parameter δ, the best asymptotic capacity attainable by any stabilizer code cannot exceed 1−H(δ). 89.80.+h, 03.65.Bz Typeset using REVTEX ∗[email protected] 1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1

The entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum M...

متن کامل

Construction of [[n,n − 4,3]]q quantum codes for odd prime power q

The theory of quantum error-correcting codes (QECCs, for short) has been exhaustively studied in the literature; see [1–8]. The most widely studied class of quantum codes are binary quantum stabilizer codes. A thorough discussion on the principles of quantum coding theory was given in [3] and [4] for binary quantum stabilizer codes. An appealing aspect of binary quantum codes is that there exis...

متن کامل

Construction X for quantum error-correcting codes

Construction X is known from the theory of classical error control codes. We present a variant of this construction that produces stabilizer quantum error control codes from arbitrary linear codes. Our construction does not require the classical linear code that is used as an ingredient to satisfy the dual containment condition. We prove lower bounds on the minimum distance of quantum codes obt...

متن کامل

ar X iv : q ua nt - p h / 06 10 15 3 v 1 18 O ct 2 00 6 Subsystem Codes

We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the qu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996